A New Method for Undecidability Proofs of First Order Theories
نویسنده
چکیده
We claim that the reduction of Post's Correspondence Problem to the decision problem of a theory provides a useful tool for proving undecidability of rst order theories given by some interpretation. The goal of this paper is to deene a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering.
منابع مشابه
On 2 nd Order Intuitionistic Propositional Calculus with Full Comprehension
(x not free in A, HPC is Heyting's predicate calculus) for the class of Kripke models of constant domains. See G6rnemann [1] for an algebraic completeness proof and Gabbay I-2] for other details. The proof of undecidability uses the same method introduced in Gabbay [3, 4] and used to obtain undecidability results for a large class of intuitionistic theories. Although some versions of the monadi...
متن کاملA Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories
A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use ...
متن کاملCombination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and deci...
متن کاملUndecidability in the Homomorphic Quasiorder of Finite Labeled Forests
We prove that the homomorphic quasiorder of finite k-labeled forests has a hereditary undecidable first-order theory for k ≥ 3, in contrast to the known decidability result for k = 2. We establish also hereditary undecidability (again for every k ≥ 3) of first-order theories of two other relevant structures: the homomorphic quasiorder of finite k-labeled trees, and of finite k-labeled trees wit...
متن کاملHereditary Undecidability of Some Theories of Finite Structures
Using a result of Gurevich and Lewis on the word problem for finite semigroups, we give short proofs that the following theories are hereditarily undecidable: (1) finite graphs of vertex-degree at most 3; (2) finite nonvoid sets with two distinguished permutations; (3) finitedimensional vector spaces over a finite field with two distinguished endomorphisms.
متن کامل